@string{rs    = "Research Series"}
@string{ns    = "Notes Series"}
@string{ls    = "Lecture Series"}
@string{ds    = "Dissertation Series"}

@string{jacm = "J. Assoc.\ Comput.\ Mach."}
@string{fjacm = "J. of the Association for Computing Machinery"}
@string{sicomp = "SIAM J.\ Comput."}
@string{fsicomp = "SIAM J. on Computing"}
@string{jcss = "J. Comput.\ System Sci."}
@string{fjcss = "J. of Computer and System Sciences"}
@string{ipl = "Inform.\ Process.\ Lett."}
@string{fipl = "Information Processing Letters"},
@string{tcs = "Theoretical Computer Science"}
@string{lncs = "Lecture Notes in Computer Science"}
@string{cacm = "Communications of the ACM"}

@string{springer = "Springer-Verlag"}
@string{ieee = "IEEE Comput.\ Soc.\ Press"}
@string{ieee-add = "Los Alamitos, CA"}

@string{proc = "Proc. of the "}
@string{appear = "Appeared at the "}
@string{toappear = "to appear"}

@string{focs = "{IEEE} Symposium on Foundations of Computer Science"}
@string{focs70 = proc # "11th " # focs # " (FOCS~'70)"}
@string{focs71 = proc # "12th " # focs # " (FOCS~'71)"}
@string{focs72 = proc # "13th " # focs # " (FOCS~'72)"}
@string{focs73 = proc # "14th " # focs # " (FOCS~'73)"}
@string{focs74 = proc # "15th " # focs # " (FOCS~'74)"}
@string{focs75 = proc # "16th " # focs # " (FOCS~'75)"}
@string{focs76 = proc # "17th " # focs # " (FOCS~'76)"}
@string{focs77 = proc # "18th " # focs # " (FOCS~'77)"}
@string{focs78 = proc # "19th " # focs # " (FOCS~'78)"}
@string{focs79 = proc # "20th " # focs # " (FOCS~'79)"}
@string{focs80 = proc # "21st " # focs # " (FOCS~'80)"}
@string{focs81 = proc # "22nd " # focs # " (FOCS~'81)"}
@string{focs82 = proc # "23rd " # focs # " (FOCS~'82)"}
@string{focs83 = proc # "24th " # focs # " (FOCS~'83)"}
@string{focs84 = proc # "25th " # focs # " (FOCS~'84)"}
@string{focs85 = proc # "26th " # focs # " (FOCS~'85)"}
@string{focs86 = proc # "27th " # focs # " (FOCS~'86)"}
@string{focs87 = proc # "28th " # focs # " (FOCS~'87)"}
@string{focs88 = proc # "29th " # focs # " (FOCS~'88)"}
@string{focs89 = proc # "30th " # focs # " (FOCS~'89)"}
@string{focs90 = proc # "31st " # focs # " (FOCS~'90)"}
@string{focs91 = proc # "32nd " # focs # " (FOCS~'91)"}
@string{focs92 = proc # "33rd " # focs # " (FOCS~'92)"}
@string{focs93 = proc # "34th " # focs # " (FOCS~'93)"}
@string{focs94 = proc # "35th " # focs # " (FOCS~'94)"}
@string{focs95 = proc # "36th " # focs # " (FOCS~'95)"}
@string{focs96 = proc # "37th " # focs # " (FOCS~'96)"}
@string{focs97 = proc # "38th " # focs # " (FOCS~'97)"}
@string{focs98 = proc # "39th " # focs # " (FOCS~'98)"}
@string{focs99 = proc # "40th " # focs # " (FOCS~'99)"}
@string{focs00 = proc # "41st " # focs # " (FOCS~'00)"}
@string{focs01 = proc # "42nd " # focs # " (FOCS~'01)"}
@string{focs02 = proc # "43rd " # focs # " (FOCS~'02)"}
@string{focs03 = proc # "44th " # focs # " (FOCS~'03)"}
@string{focs04 = proc # "45th " # focs # " (FOCS~'04)"}
@string{focs05 = proc # "46th " # focs # " (FOCS~'05)"}
@string{focs06 = proc # "47th " # focs # " (FOCS~'06)"}
@string{focs07 = proc # "48th " # focs # " (FOCS~'07)"}
@string{focs08 = proc # "49th " # focs # " (FOCS~'08)"}

@string{stoc = "{ACM} Symposium on Theory of Computing"}
@string{stoc77 = proc # "9th " # stoc # " (STOC~'77)"}
@string{stoc78 = proc # "10th " # stoc # " (STOC~'78)"}
@string{stoc79 = proc # "11th " # stoc # " (STOC~'79)"}
@string{stoc80 = proc # "12th " # stoc # " (STOC~'80)"}
@string{stoc81 = proc # "13th " # stoc # " (STOC~'81)"}
@string{stoc82 = proc # "14th " # stoc # " (STOC~'82)"}
@string{stoc83 = proc # "15th " # stoc # " (STOC~'83)"}
@string{stoc84 = proc # "16th " # stoc # " (STOC~'84)"}
@string{stoc85 = proc # "17th " # stoc # " (STOC~'85)"}
@string{stoc86 = proc # "18th " # stoc # " (STOC~'86)"}
@string{stoc87 = proc # "19th " # stoc # " (STOC~'87)"}
@string{stoc88 = proc # "20th " # stoc # " (STOC~'88)"}
@string{stoc89 = proc # "21st " # stoc # " (STOC~'89)"}
@string{stoc90 = proc # "22nd " # stoc # " (STOC~'90)"}
@string{stoc91 = proc # "23rd " # stoc # " (STOC~'91)"}
@string{stoc92 = proc # "24th " # stoc # " (STOC~'92)"}
@string{stoc93 = proc # "25th " # stoc # " (STOC~'93)"}
@string{stoc94 = proc # "26th " # stoc # " (STOC~'94)"}
@string{stoc95 = proc # "27th " # stoc # " (STOC~'95)"}
@string{stoc96 = proc # "28th " # stoc # " (STOC~'96)"}
@string{stoc97 = proc # "29th " # stoc # " (STOC~'97)"}
@string{stoc98 = proc # "30th " # stoc # " (STOC~'98)"}
@string{stoc99 = proc # "31st " # stoc # " (STOC~'99)"}
@string{stoc00 = proc # "32nd " # stoc # " (STOC~'00)"}
@string{stoc01 = proc # "33rd " # stoc # " (STOC~'01)"}
@string{stoc02 = proc # "34th " # stoc # " (STOC~'02)"}
@string{stoc03 = proc # "35th " # stoc # " (STOC~'03)"}
@string{stoc04 = proc # "36th " # stoc # " (STOC~'04)"}
@string{stoc05 = proc # "37th " # stoc # " (STOC~'05)"}
@string{stoc06 = proc # "38th " # stoc # " (STOC~'06)"}
@string{stoc07 = proc # "39st " # stoc # " (STOC~'07)"}
@string{stoc08 = proc # "40th " # stoc # " (STOC~'08)"}

@string{soda = "{ACM-SIAM} Symposium on Discrete Algorithms"}
@string{soda90 = proc # "1st " # soda # " (SODA~'90)"}
@string{soda91 = proc # "2nd " # soda # " (SODA~'91)"}
@string{soda92 = proc # "3rd " # soda # " (SODA~'92)"}
@string{soda93 = proc # "4th " # soda # " (SODA~'93)"}
@string{soda94 = proc # "5th " # soda # " (SODA~'94)"}
@string{soda95 = proc # "6th " # soda # " (SODA~'95)"}
@string{soda96 = proc # "7th " # soda # " (SODA~'96)"}
@string{soda97 = proc # "8th " # soda # " (SODA~'97)"}
@string{soda98 = proc # "9th " # soda # " (SODA~'98)"}
@string{soda99 = proc # "10th " # soda # " (SODA~'99)"}
@string{soda00 = proc # "11th " # soda # " (SODA~'00)"}
@string{soda01 = proc # "12th " # soda # " (SODA~'01)"}
@string{soda02 = proc # "13th " # soda # " (SODA~'02)"}
@string{soda03 = proc # "14th " # soda # " (SODA~'03)"}
@string{soda04 = proc # "15th " # soda # " (SODA~'04)"}
@string{soda05 = proc # "16th " # soda # " (SODA~'05)"}
@string{soda06 = proc # "17th " # soda # " (SODA~'06)"}
@string{soda07 = proc # "18th " # soda # " (SODA~'07)"}
@string{soda08 = proc # "19th " # soda # " (SODA~'08)"}
@string{soda09 = proc # "20th " # soda # " (SODA~'09)"}
@string{soda10 = proc # "21st " # soda # " (SODA~'10)"}
@string{soda11 = proc # "22nd " # soda # " (SODA~'11)"}

@string{icalp = "International Colloquium on Automata, Languages and Programming"}
@string{icalp90 = proc # "17th " # icalp # " (ICALP~'90)"}
@string{icalp92 = proc # "19th " # icalp # " (ICALP~'92)"}
@string{icalp96 = proc # "23rd " # icalp # " (ICALP~'96)"}
@string{icalp98 = proc # "25th " # icalp # " (ICALP~'98)"}
@string{icalp99 = proc # "26th " # icalp # " (ICALP~'99)"}
@string{icalp00 = proc # "27th " # icalp # " (ICALP~'00)"}
@string{icalp01 = proc # "28th " # icalp # " (ICALP~'01)"}
@string{icalp02 = proc # "29th " # icalp # " (ICALP~'02)"}
@string{icalp03 = proc # "30th " # icalp # " (ICALP~'03)"}
@string{icalp04 = proc # "31th " # icalp # " (ICALP~'04)"}
@string{icalp05 = proc # "32th " # icalp # " (ICALP~'05)"}
@string{icalp06 = proc # "33th " # icalp # " (ICALP~'06)"}
@string{icalp07 = proc # "34th " # icalp # " (ICALP~'07)"}
@string{icalp08 = proc # "35th " # icalp # " (ICALP~'08)"}

@string{esa = "European Symposium on Algorithms"}
@string{esa93 = proc # "1st " # esa # " (ESA~'93)"}
@string{esa94 = proc # "2nd " # esa # " (ESA~'94)"}
@string{esa95 = proc # "3rd " # esa # " (ESA~'95)"}
@string{esa96 = proc # "4th " # esa # " (ESA~'96)"}
@string{esa97 = proc # "5th " # esa # " (ESA~'97)"}
@string{esa98 = proc # "6th " # esa # " (ESA~'98)"}
@string{esa99 = proc # "7th " # esa # " (ESA~'99)"}
@string{esa00 = proc # "8th " # esa # " (ESA~'00)"}
@string{esa01 = proc # "9th " # esa # " (ESA~'01)"}
@string{esa02 = proc # "10th " # esa # " (ESA~'02)"}
@string{esa03 = proc # "11th " # esa # " (ESA~'03)"}
@string{esa04 = proc # "12th " # esa # " (ESA~'04)"}
@string{esa05 = proc # "13th " # esa # " (ESA~'05)"}
@string{esa06 = proc # "14th " # esa # " (ESA~'06)"}
@string{esa07 = proc # "15th " # esa # " (ESA~'07)"}
@string{esa08 = proc # "16th " # esa # " (ESA~'08)"}
@string{esa09 = proc # "17th " # esa # " (ESA~'09)"}
@string{esa10 = proc # "18th " # esa # " (ESA~'10)"}

@string{approx = "Workshop on Approximation Algorithms for Combinatorial Optimization"}
@string{approx98 = proc # "1st " # approx # " (APPROX~'98)"}
@string{approx99 = proc # "2nd " # approx # " (APPROX~'99)"}
@string{approx00 = proc # "3rd " # approx # " (APPROX~'00)"}
@string{approx01 = proc # "4th " # approx # " (APPROX~'01)"}
@string{approx02 = proc # "5th " # approx # " (APPROX~'02)"}
@string{approx03 = proc # "6th " # approx # " (APPROX~'03)"}

@string{wine = "Workshop on Internet and Network Economics"}
@string{wine05 = proc # "1st " # wine # " (WINE~'05)"}
@string{wine06 = proc # "2nd " # wine # " (WINE~'06)"}
@string{wine07 = proc # "3rd " # wine # " (WINE~'07)"}
@string{wine08 = proc # "4th " # wine # " (WINE~'08)"}
@string{wine09 = proc # "5th " # wine # " (WINE~'09)"}
@string{wine10 = proc # "6th " # wine # " (WINE~'10)"}
@string{wine11 = proc # "7th " # wine # " (WINE~'11)"}
@string{wine12 = proc # "8th " # wine # " (WINE~'12)"}

@string{ipco = "Conference on Integer Programming and Combinatorial Optimization"}
@string{ipco96 = proc # "5th " # ipco # " (IPCO~'96)"}
@string{ipco98 = proc # "6th " # ipco # " (IPCO~'98)"}
@string{ipco99 = proc # "7th " # ipco # " (IPCO~'99)"}
@string{ipco01 = proc # "8th " # ipco # " (IPCO~'01)"}
@string{ipco02 = proc # "9th " # ipco # " (IPCO~'02)"}
@string{ipco04 = proc # "10th " # ipco # " (IPCO~'04)"}
@string{ipco05 = proc # "11th " # ipco # " (IPCO~'05)"}
@string{ipco06 = proc # "12th " # ipco # " (IPCO~'06)"}

@string{stacs    = "Symposium on Theoretical Aspects of Computer Science"}
@string{stacs99  = proc # "16th " # stacs # " (STACS~'99)"}
@string{stacs04  = proc # "21st " # stacs # " (STACS~'04)"}
@string{stacs06  = proc # "23st " # stacs # " (STACS~'06)"}

@string{ec    = "{ACM} Conference on Electronic Commerce"}
@string{ec99  = proc # "1st " # ec # " (EC~'99)"}
@string{ec00  = proc # "2nd " # ec # " (EC~'00)"}
@string{ec01  = proc # "3rd " # ec # " (EC~'01)"}
@string{ec03  = proc # "4th " # ec # " (EC~'03)"}
@string{ec04  = proc # "5th " # ec # " (EC~'04)"}
@string{ec05  = proc # "6th " # ec # " (EC~'05)"}
@string{ec06  = proc # "7th " # ec # " (EC~'06)"}
@string{ec07  = proc # "8th " # ec # " (EC~'07)"}
@string{ec08  = proc # "9th " # ec # " (EC~'08)"}
@string{ec09  = proc # "10th " # ec # " (EC~'09)"}
@string{ec10  = proc # "11th " # ec # " (EC~'10)"}
@string{ec11  = proc # "12th " # ec # " (EC~'11)"}
@string{ec12  = proc # "13th " # ec # " (EC~'12)"}



@ARTICLE{NR99,
  author =   {N. Nisan and A. Ronen},
  title =    {Algorithmic Mechanism Design},
  Journal =    {Games and Economic Behavior},
  pages =    {166--196},
  year =     {2001},
  volume = {35},
}

@book{AGT-book,
 author     = {N. Nisan and T. Roughgarden and \'{E}. Tardos and V. Vazirani},
 title      = {Algorithmic Game Theory},
 year       = {2007},
 publisher  = {Cambridge University Press},
}

@article{SV07,
 author     = {J. Schummer and R.V. Vohra},
 title      = {Mechanism Design without Money},
 journal    = {Algorithmic Game Theory},
 pages      = {243--299},
 year       = {2007},
 volume     = {10},
}

 title      = {Algorithmic Game Theory},
 year       = {2007},
 publisher  = {Cambridge University Press},
}

@Book{BY98,
  author =       {A. Borodin and R. El-Yaniv},
  title =        {Online Computation and Competitive Analysis},
  publisher =    {Cambridge University Press},
  year =         {1998},
}

@Book{MF90,
  author =       {P.B. Mirchandani and R.L. Francis},
  title =        {Discrete Location Theory},
  publisher =    {Wiley},
  year =         {1990},
}

@Book{DH04,
  author =       {Z. Drezner and H.W. Hamacher},
  title =        {Facility Location: Applications and Theory},
  publisher =    {Springer},
  year =         {2004},
}

@PHDTHESIS{guha,
  author =       {S. Guha},
  title =        {Approximation Algorithms for Facility Location Problems},
  publisher =    {PhD Thesis},
  school =       {Stanford University},
  year =         {2000},
}

@inproceedings{shmoys,
  title = {Approximation Algorithms for Facility Location Problems},
  author = {D. Shmoys},
  booktitle = approx00,
  series = {LNCS},
  volume = {1913},
  year = {2000},
  pages = {27--33},
}

@article{SV02,
    title   = {Strategyproof Location on a Network},
    author  = {J. Schummer and R.V. Vohra},
    journal = {Journal of Economic Theory},
    volume  = {104},
    pages   = {405--428},
    year    = {2002},
}

@article{Gibb73,
    title   = {Manipulation of Voting Schemes},
    author  = {A. Gibbard},
    journal = {Econometrica},
    volume  = {41},
    pages   = {587--602},
    year    = {1973},
}

@article{Satter75,
    title   = {Strategyproofness and Arrow's Conditions: Existence and Correspondence Theorems for Voting Procedures and Social Welfare Functions},
    author  = {M. Satterthwaite},
    journal = {Journal of Economic Theory},
    volume  = {10},
    pages   = {187--217},
    year    = {1975},
}

@article{Bar01,
    title   = {An Introduction to Strategyproof Social Choice Functions},
    author  = {S. Barber\`{a}},
    journal = {Social Choice and Welfare},
    volume  = {18},
    pages   = {619--653},
    year    = {2001},
}


@article{Miy01,
    title   = {Locating Libraries on a Street},
    author  = {E. Miyagawa},
    journal = {Social Choice and Welfare},
    volume  = {18},
    pages   = {527--541},
    year    = {2001},
}

@article{BB06,
    title   = {Locating Public Libraries by Majority: Stability, Consistency and Group Formation},
    author  = {S. Barber\`{a} and C. Bevi\'{a}},
    journal = {Games and Economic Behaviour},
    volume  = {56},
    pages   = {185--200},
    year    = {2006},
}

@article{Fot08,
    title   = {On the Competitive Ratio for Online Facility Location},
    author  = {D. Fotakis},
    journal = {Algorithmica},
    volume  = {50},
    number  = {1},
    pages   = {1--57},
    year    = {2008},
}

@article{ABUH04,
  author =   {A. Anagnostopoulos and R. Bent and E. Upfal and P. van Hentenryck},
  title =    {A Simple and Deterministic Competitive Algorithm for Online Facility Location},
  journal =  {Information and Computation},
  volume =   {194},
  year =     {2004},
  pages =    {175--202},
}

@inproceedings{Mey01,
  title = {Online Facility Location},
  author = {A. Meyerson},
  booktitle = focs01,
  pages = "426--431",
  year = {2001},
}

@article{JV01,
  title = {Approximation Algorithms for Metric Facility Location and $k$-Median
          Problems Using the Primal-Dual Schema and Lagrangian Relaxation},
  author = {K. Jain and V. Vazirani},
  journal = {Journal of the ACM},
  volume = {48},
  number = {2},
  year = {2001},
  pages = {274--296},
}

@inproceedings{PT09,
  title = {Approximate Mechanism Design Without Money},
  author = {A.D. Procaccia and M. Tennenholtz},
  booktitle = ec09,
  pages = {177--186},
  year = {2009},
}

@inproceedings{LSWZ10,
  title = "{Asymptotically Optimal Strategy-Proof Mechanisms for Two-Facility Games}",
  author = {P. Lu and X. Sun and Y. Wang and Z.A. Zhu},
  booktitle = ec10,
  pages = {315--324},
  year = {2010},
}


@inproceedings{LWZ09,
    title       = {Tighter Bounds for Facility Games},
    author      = {P. Lu and Y. Wang and Y. Zhou},
    booktitle   = wine09,
    series      = {LNCS},
    volume      = {5929},
    pages       = {137--148},
    year        = {2009},
}


@inproceedings{FT10,
    title       = {Winner-Imposing Strategyproof Mechanisms for Multiple {Facility Location} Games},
    author      = {D. Fotakis and C. Tzamos},
    booktitle   = wine10,
    series      = {LNCS},
    volume      = {6484},
    pages       = {234--245},
    year        = {2010},
}

@inproceedings{Kouts11,
    title       = {Scheduling without Payments},
    author      = {E. Koutsoupias},
    booktitle   = {Proc. of the 4th International Symposium on Algorithmic Game Theory (SAGT~'11)},
    series      = {LNCS},
    volume      = {6982},
    pages       = {143--153},
    year        = {2011},
}

@inproceedings{EGTPS11,
    title       = {Strategy-Proof Mechanisms for {Facility Location} Games with Many Facilities},
    author      = {B. Escoffier and L. Gourv\`{e}s and N.K. Thang and F. Pascual and O. Spanjaard},
    booktitle   = {Proc. of the 2nd International Conference on Algorithmic Decision Theory (ADT~'11)},
    series      = {LNAI},
    volume      = {6992},
    pages       = {67--81},
    year        = {2011},
}

@article{AFPT09,
    title   = {Strategyproof Approximation of the Minimax on Networks},
    author  = {N. Alon and M. Feldman and A.D. Procaccia and M. Tennenholtz},
    journal = {Mathematics of Operations Research},
    volume  = {35},
    number  = {3},
    pages   = {513--526},
    year    = {2010},
}

@article{Spru91,
    title   = {The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule},
    author  = {Y. Sprumont},
    journal = {Econometrica},
    volume  = {49},
    pages   = {509--519},
    year    = {1991},
}


@article{Spru95,
    title   = {Strategyproof Collective Choice in Economic and Political Environments},
    author  = {Y. Sprumont},
    journal = {The Canadian Journal of Economics},
    volume  = {28},
    number  = {1},
    pages   = {68--108},
    year    = {1995},
}


@article{BJ94,
    title   = {A Characterization of Strategy-Proof Social Choice Functions for Economies with Pure Public Goods},
    author  = {S. Barber\`{a} and M. Jackson},
    journal = {Journal of Economic Theory},
    volume  = {61},
    pages   = {262--289},
    year    = {1994},
}


@article{NST10,
    title   = {Approximately Optimal Mechanism Design via {Differential Privacy}},
    author  = {K. Nissim and R. Smorodinsky and M. Tennenholtz},
    journal = {CoRR abs},
    volume  = {1004.2888},
    year    = {2010},
    notes   = {Also in the \emph{Proc. of the 3rd Conference on Innovations in Theoretical Computer Science (ICS~12)}.}},
}

@article{FW11,
    title   = {Randomized Strategyproof Mechanisms for {Facility Location} and the Mini-Sum-of-Squares Objective},
    author  = {M. Feldman and Y. Wilf},
    journal = {CoRR abs},
    volume  = {1108.1762},
    year    = {2011},
}


@inproceedings{MT07,
  title = {Mechanism Design via Differential Privacy},
  author = {F. McSherry and K. Talwar},
  booktitle = focs07,
  pages = {94--103},
  year = {2007},
}

@inproceedings{GLMRT10,
  title = {Differentially Private Combinatorial Optimization},
  author = {A. Gupta and K. Ligett and F. McSherry and A. Roth and K. Talwar},
  booktitle = soda10,
  year = {2010},
}



@article{Moul80,
    title   = {On Strategy-Proofness and Single-Peakedness},
    author  = {H. Moulin},
    journal = {Public Choice},
    volume  = {35},
    pages   = {437--455},
    year    = {1980},
}

@article{Ju08,
    title   = {Efficiency and Consistency for Locating Multiple Public Facilities},
    author  = {B.-G. Ju},
    journal = {Journal of Economic Theory},
    volume  = {138},
    pages   = {165--183},
    year    = {2008},
}


@article{BBT85,
    title   = {Minimum Cost Flow Algorithms for Series-Parallel Networks},
    author  = {W. Bein and P. Brucker and A. Tamir},
    journal = {Discrete Applied Mathematics},
    volume  = {10},
    pages   = {117--124},
    year    = {1985},
}

@article{Nash50,
    title   = {Equilibrium Points in $n$-Person Games},
    author  = {J.F. Nash},
    journal = {Proc. of the National Academy of Sciences},
    volume  = {36},
    pages   = {48--49},
    year    = {1950},
}

@article{Nash51,
    title   = {Non-cooperative Games},
    author  = {J.F. Nash},
    journal = {Annals of Mathematics},
    volume  = {54},
    pages   = {286--295},
    year    = {1951},
}

@Book{BMW56,
  title     = {Studies in the Economics of Transportation},
  author    = {M. Beckmann and C.B. McGuire and C.B. Winsten},
  publisher = {Yale University Press},
  year      = {1956},
}

@Book{BSS93,
  title     = {Nonlinear Programming: Theory and Algorithms (2nd edition)},
  author    = {M.S. Bazaraa and H.D. Sherali and C.M. Shetty},
  publisher = {John Wiley and Sons, Inc.},
  year      = {1993},
}

@Book{AMO93,
  title     = {Network Flows: Theory, Algorithms, and Applications},
  author    = {R.K. Ahuja and T.L. Magnanti and J.B. Orlin},
  publisher = {Prentice Hall},
  year      = {1993},
}


@inproceedings{CFKKM07,
    title       = {Tight Bounds for Selfish and Greedy Load Balancing},
    author      = {I. Caragiannis and M. Flammini and C. Kaklamanis and P. Kanellopoulos and L. Moscardelli},
    booktitle   = icalp06,
    series      = {LNCS},
    volume      = {4051},
    publisher   = springer,
    pages       = {311--322},
    year        = {2006},
}


@inproceedings{AKT08,
    title       = {Social Context Games},
    author      = {I. Ashlagi and P. Krysta and M. Tennenholtz},
    booktitle   = wine08,
    series      = {LNCS},
    volume      = {5385},
    publisher   = springer,
    pages       = {675--683},
    year        = {2008},
}

@inproceedings{BFFM08,
    title       = {Graphical Congestion Games},
    author      = {V. Bil\`{o} and A. Fanelli and M. Flammini and L. Moscardelli},
    booktitle   = wine08,
    series      = {LNCS},
    volume      = {5385},
    publisher   = springer,
    pages       = {70--81},
    year        = {2008},
}

@inproceedings{KKVX07,
    title       = {Selfish Routing with Oblivious Users},
    author      = {G. Karakostas and T. Kim and A. Viglas and H. Xia},
    booktitle   = {Proc. of the 14th Colloquium on Structural Information and Communication Complexity (SIROCCO~'07)},
    series      = {LNCS},
    volume      = {4474},
    publisher   = springer,
    pages       = {318--327},
    year        = {2007},
}

@inproceedings{CKV02,
    title       = {Selfish  Traffic Allocation for Server Farms},
    author      = {A. Czumaj and P. Krysta and B. V\"{o}cking},
    booktitle   = stoc02,
    pages       = {287--296},
    year        = {2002},
}

@inproceedings{EFM07a,
    title       = {Strong Equilibrium in Cost Sharing Connection Games},
    author      = {A. Epstein and M. Feldman and Y. Mansour},
    booktitle   = ec07,
    pages       = {84--92},
    year        = {2007},
}


@inproceedings{EFM07b,
    title       = "{Efficient Graph Topologies in Network Routing Games}",
    author      = {A. Epstein and M. Feldman and Y. Mansour},
    booktitle   = {Joint Workshop on Economics of Networked Systems and
                   Incentive-Based Computing (NetEcon+IBC~'07)},
    year        = {2007},
}



@inproceedings{AAE05,
    title       = "{The Price of Routing Unsplittable Flow}",
    author      = {B. Awerbuch and Y. Azar and A. Epstein},
    booktitle   = stoc05,
    pages       = {57--66},
    year        = {2005},
}

@inproceedings{CK05,
    title       = "{The Price of Anarchy of Finite Congestion Games}",
    author      = {G. Christodoulou and E. Koutsoupias},
    booktitle   = stoc05,
    pages       = {67--73},
    year        = {2005},
}

@inproceedings{CK05b,
    title       = "{On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games}",
    author      = {G. Christodoulou and E. Koutsoupias},
    booktitle   = esa05,
    series      = {LNCS},
    volume      = {3669},
    publisher   = springer,
    pages       = {59--70},
    year        = {2005},
}

@inproceedings{CKS09,
    title       = "{On the Performance of Approximate Equilibria in Congestion Games}",
    author      = {G. Christodoulou and E. Koutsoupias and P. Spirakis},
    booktitle   = esa09,
    pages       = {to appear},
    year        = {2009},
}


@inproceedings{CV02,
    title       = "{Tight Bounds for Worst-case Equilibria}",
    author      = {A. Czumaj and B. V\"{o}cking},
    booktitle   = soda02,
    pages       = {413--420},
    year        = {2002},
}

@article{DS69,
    title   = "{The Traffic Assignment Problem for a General Network}",
    author  = {S. Dafermos and F. Sparrow},
    journal = {Research of the National Bureau of Standards},
    volume  = {73B},
    pages   = {91--118},
    year    = {1969},
}

@article{GMT08,
    title   = "{Selfish Routing with Incomplete Information}",
    author  = {M. Gairing and B. Monien and K. Tiemann},
    journal = {Theory of Computing Systems},
    volume  = {42},
    pages   = {91--130},
    year    = {2008},
}


@article{VTL82,
    title   = "{The Recognition of Series-Parallel Digraphs}",
    author  = {J. Valdez and R.E. Tarjan and E.L. Lawler},
    journal = sicomp,
    volume  = {11},
    number  = {2},
    pages   = {298--313},
    year    = {1982},
}

@article{Dorn60,
  title     = "{Duality in Quadratic Programming}",
  author    = {W.S. Dorn},
  journal   = {Quarterly of Applied Mathematics},
  volume    = {18},
  number    = {2},
  pages     = {155--162},
  year      = {1960},
}

@article{ORS93,
  title     = "{Competitive Routing in Multiuser Communication Networks}",
  author    = {A. Orda and R. Rom and N. Shimkin},
  journal   = {IEEE/ACM Transactions on Networking},
  volume    = {1},
  pages     = {510--521},
  year      = {1993},
}

@article{KLO97,
  title     = "{Achieving Network Optima Using Stackelberg Routing Strategies}",
  author    = {Y.A. Korilis and A.A. Lazar and A. Orda},
  journal   = {IEEE/ACM Transactions on Networking},
  volume    = {5},
  number    = {1},
  pages     = {161--173},
  year      = {1997},
}




@article{LO01,
  title     = "{Atomic Resource Sharing in Noncooperative Networks}",
  author    = {L. Libman and A. Orda},
  journal   = {Telecommunication Systems},
  volume    = {17},
  number    = {4},
  pages     = {385--409},
  year      = {2001},
}

@inproceedings{EKM03,
    title       = "{Convergence Time to Nash Equilibria}",
    author      = {E. Even-Dar and A. Kesselman and Y. Mansour},
    booktitle   = icalp03,
    pages       = {502-513},
    publisher   = springer,
    series      = {LNCS},
    volume      = {2719},
    year        = {2003},
}

@article{EKM07,
    title       = "{Convergence Time to Nash Equilibria in Load Balancing}",
    author      = {E. Even-Dar and A. Kesselman and Y. Mansour},
    journal     = {ACM Transactions on Algorithms},
    volume      = {3},
    number      = {3},
    year        = {2007},
}


@inproceedings{KS06,
    title       = "{The Price of Optimum in Stackelberg Games on Arbitrary Single Commodity Networks and Latency Functions}",
    author      = {A.C. Kaporis and P.G. Spirakis},
    booktitle   = {SPAA 2006},
    pages       = {19--28},
    year        = {2006},
}

@inproceedings{SW07,
    title       = "{Stackelberg Thresholds in Network Routing Games}",
    author      = {Y. Sharma and D.P. Williamson},
    booktitle   = ec07,
    pages       = {93-102},
    year        = {2007},
}


@inproceedings{CS07,
    title       = "{Convergece to Approximate Nash Equilibria in Congestion Games}",
    author      = {S. Chien and A. Sinclair},
    booktitle   = soda07,
    pages       = {169--178},
    year        = {2007},
}

@inproceedings{Swamy07,
    title       = "{The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games}",
    author      = {C. Swamy},
    booktitle   = soda07,
    pages       = {1133--1142},
    year        = {2007},
}

@inproceedings{FPT04,
  title         = "{The Complexity of Pure Nash Equilibria}",
  author        = {A. Fabrikant and C. Papadimitriou and K. Talwar},
  booktitle     = stoc04,
  pages         = {604--612},
  year          = {2004},
}

@inproceedings{GMV05,
  title         = "{Sink Equilibria and Convergence}",
  author        = {M. Goemans and V. Mirrokni and A. Vetta},
  booktitle     = focs05,
  pages         = {142-154},
  year          = {2005},
}

@inproceedings{IMNSS05,
  author    = {S. Ieong and R. McGrew and E. Nudelman and Y. Shoham and Q. Sun},
  title     = {Fast and Compact: A Simple Class of Congestion Games},
  booktitle = {20th National Conference on Artificial Intellingence (AAAI~'05)},
  year      = {2005},
  pages     = {489--494},
}


@inproceedings{Bere06,
  title         = "{Distributed Selfish Load Balancing}",
  author        = {P. Berenbrink and T. Friedetzky and L.A. Goldberg and P. Goldberg and Z. Hu and R. Martin},
  booktitle     = soda06,
  pages         = {354--363},
  year          = {2006},
}

@inproceedings{Fot07,
  title         = "{Stackelberg Strategies for Atomic Congestion Games}",
  author        = {D. Fotakis},
  booktitle     = esa07,
  series        = {LNCS},
  volume        = {4698},
  publisher     = springer,
  pages         = {299--310},
  year          = {2007},
}



@article{FKS04,
  title         = "{Selfish Unsplittable Flows}",
  author        = {D. Fotakis and S. Kontogiannis and P. Spirakis},
  journal       = {Theoretical Computer Science},
  volume        = {348},
  pages         = {226--239},
  publisher     = {Elsevier},
  year          = {2005},
}

@inproceedings{CCS06,
  title         = "{Network Games with Atomic Players}",
  author        = {R. Cominetti and J.R. Correa and N.E. Stier-Moses},
  booktitle     = icalp06,
  volume        = {4051},
  publisher     = springer,
  series        = {LNCS},
  pages         = {604--612},
  year          = {2006},
}

@inproceedings{FKS06,
  title         = "{Atomic Congestion Games among Coalitions}",
  author        = {D. Fotakis and S. Kontogiannis and P. Spirakis},
  booktitle     = icalp06,
  volume        = {4051},
  publisher     = springer,
  series        = {LNCS},
  pages         = {573--584},
  year          = {2006},
}



@inproceedings{FGLMR03,
    title       = "{Nashification and the Coordination Ratio for a Selfish Routing Game}",
    author      = {R. Feldmann and M. Gairing and T. L\"{u}cking and B. Monien and M. Rode},
    booktitle   = icalp03,
    volume      = {2719},
    pages       = {514--526},
    publisher   = springer,
    series      = {LNCS},
    year        = {2003},
}

@inproceedings{FKKMS02,
    title       = "{The Structure and Complexity of Nash Equilibria for a Selfish Routing Game}",
    author      = {D. Fotakis and S. Kontogiannis and E. Koutsoupias and M. Mavronicolas and P. Spirakis},
    booktitle   = icalp02,
    volume      = {2380},
    pages       = {123--134},
    publisher   = springer,
    series      = {LNCS},
    year        = {2002},
}

@inproceedings{GLMM04,
    title       = "{Computing Nash Equilibria for Scheduling on Restricted Parallel Links}",
    author      = {M. Gairing and T. L\"{u}cking and M. Mavronicolas and B. Monien},
    booktitle   = stoc04,
    pages       = {613--622},
    year        = {2004},
}

@inproceedings{GLMMR04,
    title       = "{Nash Equilibria in Discrete Routing Games with Convex Latency Functions}",
    author      = {M. Gairing and T. L\"{u}cking and M. Mavronicolas and B. Monien and M. Rode},
    booktitle   = icalp04,
    volume      = {3142},
    pages       = {645--657},
    publisher   = springer,
    series      = {LNCS},
    year        = {2004},
}

@inproceedings{GLMT05,
    title       = "{Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture}",
    author      = {M. Gairing and T. L\"{u}cking and B. Monien and K. Tiemann},
    booktitle   = icalp05,
    volume      = {3580},
    pages       = {51--65},
    publisher   = springer,
    series      = {LNCS},
    year        = {2005},
}

@inproceedings{ADGMS06,
    title       = "{Exact Price of Anarchy for Polynomial Congestion Games}",
    author      = {S. Aland and D. Dumrauf and M. Gairing and B. Monien and F. Schoppmann},
    booktitle   = stacs06,
    volume      = {3884},
    pages       = {218--229},
    publisher   = springer,
    series      = {LNCS},
    year        = {2006},
}

@inproceedings{GLMMS03,
    title       = "{Extreme Nash Equilibria}",
    author      = {M. Gairing and T. L\"{u}cking and M. Mavronicolas and B. Monien and P. Spirakis},
    booktitle   = {Proc. of the 8th Italian Conference on Theoretical Computer Science (ICTCS'03)},
    volume      = {2841},
    pages       = {1-20},
    publisher   = springer,
    series      = {LNCS},
    year        = {2003},
}

@article{Hoef63,
  title         = "{Probability Inequalities for Sums of Bounded Random Variables}",
  author        = {W. Hoeffding},
  journal       = {Journal of the American Statistical Association},
  volume        = {58},
  number        = {301},
  pages         = "13--30",
  year          = {1963},
}

@article{HS88,
    title       = "{A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach}",
    author      = {D. Hochbaum and D. Shmoys},
    journal     = sicomp,
    volume      = {17},
    number      = {3},
    pages       = {539--551},
    year        = {1988},
}

@article{Rough_Stack,
    title       = "{Stackelberg Scheduling Strategies}",
    author      = {T. Roughgarden},
    journal     = sicomp,
    volume      = {33},
    number      = {2},
    pages       = {332--350},
    year        = {2004},
}



@inproceedings{CDR03,
    title       = "{Pricing Network Edges for Heterogeneous Selfish Users}",
    author      = {R. Cole and Y. Dodis and T. Roughgarden},
    booktitle   = stoc03,
    pages       = {521--530},
    year        = {2003},
}


@inproceedings{ADKTWR04,
    title       = "{The Price of Stability for Network Design with Fair Cost Allocation}",
    author      = {E. Anshelevich and A. Dasgupta and J. Kleinberg and \'{E}. Tardos and T. Wexler and T. Roughgarden},
    booktitle   = focs04,
    pages       = {295---304},
    year        = {2004},
}


@inproceedings{Rough06_survey,
    title       = "{Selfish Routing and the Price of Anarchy}",
    author      = {T. Roughgarden},
    booktitle   = {In the Proc. of ??th Optima},
    pages       = {???--???},
    year        = {2006},
}



@inproceedings{FJM04,
    title       = "{Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games}",
    author      = {L. Fleischer and K. Jain and M. Mahdian},
    booktitle   = focs04,
    pages       = {277--285},
    year        = {2004},
}

@inproceedings{KK04,
    title       = "{Edge Pricing of Multicommodity Networks for Heterogeneous Users}",
    author      = {G. Karakostas and S. Kolliopoulos},
    booktitle   = focs04,
    pages       = {268--276},
    year        = {2004},
}

@inproceedings{KK06,
    title       = "{Stackelberg Strategies for Selfish Routing in General Multicommodity Networks}",
    author      = {G. Karakostas and S. Kolliopoulos},
    booktitle   = {Technical Report AdvOL 2006/08, McMaster University},
    year        = {2006},
}


@article{Rough02,
    title       = "{The Price of Anarchy is Independent of the Network Topology}",
    author      = {T. Roughgarden},
    journal     = jcss,
    volume      = {67},
    number      = {2},
    pages       = {341--364},
    year        = {2003},
}

@article{KMS03,
    title       = "{Approximate Equilibria and Ball Fusion}",
    author      = {E. Koutsoupias and M. Mavronicolas and P. Spirakis},
    journal     = tocs,
    volume      = {36},
    pages       = {683--693},
    year        = {2003},
}

@article{DR98,
    title       = "{Balls and Bins: A Study in Negative Dependence}",
    author      = {D. Dubhashi and D. Ranjan},
    journal     = {Random Structures and Algorithms},
    volume      = {13},
    number      = {2},
    pages       = {99--124},
    year        = {1998},
}

@article{HLY03,
    title       = "{Network Structure and Strong Equilibrium in Route Selection Games}",
    author      = {R. Holzman and N. Law-Yone (Lev-tov)},
    journal     = {Mathematical Social Sciences},
    volume      = {46},
    pages       = {193--205},
    year        = {2003},
}

@article{HLY97,
    title       = "{Strong Equilibrium in Congestion Games}",
    author      = {R. Holzman and N. Law-Yone},
    journal     = {Games and Economic Behaviour},
    volume      = {21},
    pages       = {85--101},
    year        = {1997},
}


@article{Mil06a,
    title       = "{Network Topology and the Efficiency of Equilibrium}",
    author      = {I. Milchtaich},
    journal     = {Games and Economic Behaviour},
    volume      = {57},
    pages       = {321--346},
    year        = {2006},
}


@article{Czu04,
    title       = "{Selfish Routing on the Internet}",
    author      = {A. Czumaj},
    journal     = {Handbook of Scheduling: Algorithms, Models, and Performance Analysis},
    publisher   = {Chapter~42, J. Leung (ed.), CRC Press},
    year        = {2004},
}

@article{Flei05,
    title       = "{Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks}",
    author      = {L. Fleischer},
    journal     = tcs,
    volume      = {348},
    pages       = {217--225},
    year        = {2005},
}

@inproceedings{Mil06b,
    title       = "{The Equilbrium Existence Problem in Finite Network Congestion Games}",
    author      = {I. Milchtaich},
    booktitle   = {Proc. of the 2nd Workshop on Internet and Network Economics (WINE '06)},
    volume      = {4286},
    series      = {LNCS},
    publisher   = springer,
    pages       = {87--98},
    year        = {2006},
}

@inproceedings{ARV06b,
    title       = "{Pure Nash Equilibria in Player-Specific and Weighted Congestion Games}",
    author      = {H. Ackermann and H. R\"{o}glin and B. V\"{o}cking},
    booktitle   = {Proc. of the 2nd Workshop on Internet and Network Economics (WINE '06)},
    volume      = {4286},
    series      = {LNCS},
    publisher   = springer,
    pages       = {50--61},
    year        = {2006},
}

@inproceedings{CKK06,
    title       = "{Taxes for Linear Atomic Congestion Games}",
    author      = {I. Caragiannis and C. Kaklamanis and P. Kanellopoulos},
    booktitle   = esa06,
    series      = {LNCS},
    volume      = {4168},
    publisher   = springer,
    pages       = {184--195},
    year        = {2006},
}

@inproceedings{KP99,
    title       = "{Worst-case Equilibria}",
    author      = {E. Koutsoupias and C. Papadimitriou},
    booktitle   = stacs99,
    series      = {LNCS},
    pages       = {404--413},
    publisher   = springer,
    volume      = {1563},
    year        = {1999},
}

@article{ARV06,
    title   = "{On the Impact of Combinatorial Structre on Congestion Games}",
    author  = {H. Ackermann and H. R\"{o}glin and B. V\"{o}cking},
    journal = fjacm,
    volume  = {55},
    number  = {6},
    year    = {2008},
    pages   = {article~25},
}

@inproceedings{SV08,
    title       = "{Inapproximability of Pure Nash Equilibria}",
    author      = {A. Skopalik and B. V\"{o}cking},
    booktitle   = stoc08,
    pages       = {355--364},
    year        = {2008},
}

@inproceedings{AAE08,
    title       = "{Fast Convergence to Nearly Optimal Solutions in Potential Games}",
    author      = {B. Awerbuch and Y. Azar and A. Epstein and V. Mirrokni and A. Skopalik},
    booktitle   = ec08,
    pages       = {264--273},
    year        = {2008},
}


@inproceedings{LMMRS03,
    title       = "{Which is the Worst-Case Nash Equilibrium?}",
    author      = {T. L\"{u}cking and M. Mavronicolas and B. Monien and M. Rode and P. Spirakis and I. Vrto},
    booktitle   = {Proc. of the 28th Symposium on Mathematical Foundations of Computer Science (MFCS~'03)},
    volume      = {2747},
    series      = {LNCS},
    publisher   = springer,
    pages       = {551--561},
    year        = {2003},
}

@inproceedings{KPS07,
    title       = "{Selfish Load Balancing Under Partial Knowledge}",
    author      = {E. Koutsoupias and P. Panagopoulou and P. Spirakis},
    booktitle   = {Proc. of the 32nd Symposium on Mathematical Foundations of Computer Science (MFCS~'07)},
    volume      = {4708},
    series      = {LNCS},
    publisher   = springer,
    pages       = {609--620},
    year        = {2007},
}


@inproceedings{BFFM08b,
    title       = "{When Ignorance Helps: Graphical Multicast Cost Sharing Games}",
    author      = {V. Bil\`{o} and A. Fanelli and M. Flammini and L. Moscardelli},
    booktitle   = {Proc. of the 33rd Symposium on Mathematical Foundations of Computer Science (MFCS~'08)},
    volume      = {5162},
    series      = {LNCS},
    publisher   = springer,
    pages       = {108--199},
    year        = {2008},
}



@inproceedings{LMMR04,
    title       = "{A New Model for Selfish Routing}",
    author      = {T. L\"{u}cking and M. Mavronicolas and B. Monien and M. Rode},
    booktitle   = stacs04,
    series      = {LNCS},
    publisher   = springer,
    pages       = {547--558},
    volume      = {2996},
    year        = {2004},
}

@inproceedings{LRT04,
  title         = "{A Stronger Bound on Braess's Paradox}",
  author        = {H. Lin and T. Roughgarden and \'{E}. Tardos},
  booktitle     = soda04,
  pages         = {340--341},
  year          = {2004},
}

@inproceedings{EM05,
  title         = "{Fast Convergence of Selfish Rerouting}",
  author        = {E. Even-Dar and Y. Mansour},
  booktitle     = soda05,
  pages         = {772--781},
  year          = {2005},
}


@inproceedings{MS01,
  title         = "{The Price of Selfish Routing}",
  author        = {M. Mavronicolas and P. Spirakis},
  booktitle     = stoc01,
  pages         = {510--519},
  year          = {2001},
}

@article{Mil96,
    title       = "{Congestion Games with Player-Specific Payoff Functions}",
    author      = {I. Milchtaich},
    journal     = {Games and Economic Behavior},
    volume      = {13},
    pages       = {111--124},
    year        = {1996},
}


@article{MS96,
    title       = "{Potential Games}",
    author      = {D. Monderer and L. Shapley},
    journal     = {Games and Economic Behavior},
    volume      = {14},
    pages       = {124--143},
    year        = {1996},
}

@inproceedings{Papa01,
    title       = "{Algorithms, games and the Internet}",
    author      = {C. Papadimitriou},
    booktitle   = stoc01,
    pages       = {749--753},
    year        = {2001},
}

@Book{PS82,
    title         = "{Combinatorial Optimization: Algorithms and Complexity}",
    author        = {C. Papadimitriou and K. Steiglitz},
    publisher     = {Prentice-Hall, Inc.},
    year          = {1982},
}

@article{Ros73,
    title       = "{A Class of Games Possessing Pure-Strategy Nash Equilibria}",
    author      = {R.W. Rosenthal},
    journal     = {International Journal of Game Theory},
    volume      = {2},
    year        = {1973},
    pages       = {65--67},
}

@inproceedings{Rough01,
    title       = "{Designing Networks for Selfish Users is Hard}",
    author      = {T. Roughgarden},
    booktitle   = focs01,
    pages       = {472--481},
    year        = {2001},
}

@inproceedings{Rough04,
    title       = "{The Maximum Latency of Selfish Routing}",
    author      = {T. Roughgarden},
    booktitle   = soda04,
    pages       = {980--981},
    year        = {2004},
}

@inproceedings{Weitz01,
    title       = "{The Price of Anarchy}",
    author      = {D. Weitz},
    booktitle   = {Unpubliched manuscript},
    year        = {2001},
}

@article{CSS04_MOR,
    title       = "{Selfish Routing in Capacitated Networks}",
    author      = {J.R. Correa and A.S. Schulz and N.E. Stier Moses},
    journal     = {Mathematics of Operations Research},
    volume      = {29},
    number      = {4},
    year        = {2004},
    pages       = {961--976},
}

@inproceedings{CSS04,
    title       = "{Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem}",
    author      = {J.R. Correa and A.S. Schulz and N.E. Stier Moses},
    booktitle   = ipco04,
    pages       = {59--73},
    volume      = {3064},
    series      = {LNCS},
    publisher   = springer,
    year        = {2004},
}

@inproceedings{KM02,
    title       = "{Improved Results for Stackelberg Strategies}",
    author      = {V.S.A. Kumar and M.V. Marathe},
    booktitle   = icalp02,
    pages       = {776--787},
    volume      = {2380},
    series      = {LNCS},
    publisher   = springer,
    year        = {2002},
}

@inproceedings{CSS05,
    title       = "{On the Inefficiency of Equilibria in Congestion Games}",
    author      = {J.R. Correa and A.S. Schulz and N.E. Stier Moses},
    booktitle   = ipco05,
    pages       = {167--181},
    series      = {LNCS},
    volume      = {3509},
    publisher   = springer,
    year        = {2005},
}

@inproceedings{Rough02proc,
    title       = "{The Price of Anarchy is Independent of the Network Topology}",
    author      = {T. Roughgarden},
    booktitle   = stoc02,
    pages       = {428--437},
    year        = {2002},
}

@article{RT02,
    title   = "{How Bad is Selfish Routing?}",
    author  = {T. Roughdarden and \'{E}. Tardos},
    journal = fjacm,
    volume  = {49},
    number  = {2},
    year    = {2002},
    pages   = {236--259},
}

@inproceedings{HTW06,
    title       = "{The Effect of Collusion in Congestion Games}",
    author      = {A. Hayrapetyan and \'{E}. Tardos and T. Wexler},
    booktitle   = stoc06,
    pages       = {89--98},
    year        = {2006},
}

@inproceedings{AAWY97,
    title       = "{Approximation Schemes for Scheduling}",
    author      = {N. Alon and Y. Azar and G. Woeginger and T. Yadid},
    booktitle   = soda97,
    pages       = {493--500},
    year        = {1997},
}
